Canonical decomposition of catenation of factorial languages
نویسنده
چکیده
According to a previous result by S. V. Avgustinovich and the author, each factorial language admits a unique canonical decomposition to a catenation of factorial languages. In this paper, we analyze the appearance of the canonical decomposition of a catenation of two factorial languages whose canonical decompositions are given.
منابع مشابه
Ordered Catenation Closures and Decompositions of Languages Related to a Language of Derick Wood
We investigate the problem of decomposing a language into a catenation of nontrivial languages, none of which can be decomposed further. In many cases this leads to the operation of an ordered catenation closure, introduced in this paper. We study properties of this operation, as well as its iterations. Special emphasis is on laid on ordered catenation closures of finite languages. It is also s...
متن کاملSimple equations on binary factorial languages
We consider equations on the monoid of factorial languages on the binary alphabet. We use the notion of a canonical decomposition of a factorial language and previous results by Avgustinovich and the author to solve several simple equations on binary factorial languages including Xn = Y n, the commutation equation XY = Y X and the conjugacy equation XZ = ZY . At the end of the paper we discuss ...
متن کاملOn the decomposition of finite languages
Representations of nite languages as a product (catenation) of languages are investigated, where the factor languages are \prime", that is, cannot be decomposed further in a nontrivial manner. In general, such prime decompositions are not unique even the number of factors can vary exponentially. The paper investigates the uniqueness of prime decompositions, as well as the commuting of the facto...
متن کاملState Complexity of Orthogonal Catenation
A language L is the orthogonal catenation of languages L1 and L2 if every word of L can be written in a unique way as a catenation of a word in L1 and a word in L2. We establish a tight bound for the state complexity of orthogonal catenation of regular languages. The bound is smaller than the bound for arbitrary catenation.
متن کاملMetaheuristics for the Decomposition of Finite Languages
In this paper, solution methods for the decomposition of a finite language are presented. The goal is to represent a finite language as a product (catenation) of two languages. This problem is thought to be intractable, although its NP-hardness has not been proven. The methods are based on checking through subsets of the states of a minimal acyclic DFA by means of known metaheuristics: simulate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0610149 شماره
صفحات -
تاریخ انتشار 2006